Efficient algorithms for maximum likelihood decoding in the surface code
نویسندگان
چکیده
منابع مشابه
Adaptive Maximum-Likelihood Decoding Algorithms for Linear Block Codes
This correspondence represents two new soft decision decoding algorithms that promise to reduce complexity and at the same time achieve the maximum likelihood decoding (MLD) performance. The first method is an Adaptive Two-Stage Maximum Likelihood Decoder [1] that first estimates a minimum sufficient set and performs decoding within the smaller set to reduce complexity and at the same time achi...
متن کاملAn Efficient Quasi-Maximum Likelihood Decoding for Finite Constellations
In Multi-Input Multi-Output (MIMO) systems, maximum-likelihood (ML) decoding is equivalent to finding the closest lattice point in an N -dimensional complex space. In general, this algorithm is known to be NP hard. In this paper, we propose a quasi-maximum likelihood algorithm based on Semi-Definite Programming (SDP). We introduce several SDP relaxation models for MIMO systems, with increasing ...
متن کاملEfficient Statistical Pruning for Maximum Likelihood Decoding Radhika
In many communications problems, maximum-likelihood (ML) decoding reduces to finding the closest (skewed) lattice point in N-dimensions to a given point x E CN. In its full generality, this problem is known to he NP-complete and requires exponential complexity in iV. Recently, the expected complexity of the sphere decoder, a particular algorithm that solves the ML problem exactly, has been comp...
متن کاملEfficient Convergent Maximum Likelihood Decoding on Tail-Biting Trellises
An algorithm for exact maximum likelihood(ML) decoding on tail-biting trellises is presented, which exhibits very good average case behavior. An approximate variant is proposed, whose simulated performance is observed to be virtually indistinguishable from the exact one at all values of signal to noise ratio, and which effectively performs computations equivalent to at most two rounds on the ta...
متن کاملEfficient Implementation of the New Restricted Maximum Likelihood Algorithms
Recently tridiagonalizafion and diagonalization have been proposed as methods to speed the EM algorithm for variance component estimation in restricted maximum likelihood. These methods require approximately the same computing resources, but only if the most efficient strategies are employed. When eigenvectors are explicitly calculated in diagonalization, computing requirements more than double...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2014
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.90.032326